On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework
نویسندگان
چکیده
منابع مشابه
A Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملA Fuzzy Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem
Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملMathematical Models of Flow Shop and Job Shop Scheduling Problems
In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...
متن کاملA tabu search approach for makespan minimization in a permutation flow shop scheduling problems
On a permutation flowshop scheduling problem(PFSP), n jobs are arranged on m machines in a series with the same routing for each machine. The objective of scheduling is to find a sequence of jobs under minimization of makespan. From many researches, the upperbound values from the benchmark problems have been shown. In this paper, a tabu search approach for improving the upperbound values from t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2017
ISSN: 2345-3605
DOI: 10.24200/sci.2017.4443